Modularity of P-Log Programs
نویسندگان
چکیده
We propose an approach for modularizing P-log programs and corresponding compositional semantics based on conditional probability measures. We do so by resorting to Oikarinen and Janhunen’s definition of a logic program module and extending it to P-log by introducing the notions of input random attributes and output literals. For answering to P-log queries our method does not imply calculating all the stable models (possible worlds) of a given program, and previous calculations can be reused. Our proposal also handles probabilistic evidence by conditioning (observations).
منابع مشابه
Modularity of P-log programs
We propose an approach for modularizing P-log programs and corresponding compositional semantics based on conditional probability measures. We do so by resorting to Oikarinen and Janhunen’s definition of a logic program module and extending it to P-log by introducing the notions of input random attributes and output literals. For answering to P-log queries our method does not imply calculating ...
متن کاملAbstract Domains for Reordering CLP(RLin) Programs
domains for reordering CLP(RLin) programs V. Ramachandran, P. Van Hentenryck, A. Cortesi* a Brown University, Computer Science Department, Box 1910, Providence, RI 02912, USA b Universite Catholique de Louvain, 2 Place Sainte-Barbe, B-1348 Louvain-la-Neuve, Belgium c Universit a Ca' Foscari, Dipartimento di Informatica, via Torino 155, 1-30170 Venezia, Italy Received 8 November 1997; received ...
متن کاملMining Overlapping Communities in Real-world Networks Based on Extended Modularity Gain
Detecting communities plays a vital role in studying group level patterns of a social network and it can be helpful in developing several recommendation systems such as movie recommendation, book recommendation, friend recommendation and so on. Most of the community detection algorithms can detect disjoint communities only, but in the real time scenario, a node can be a member of more than one ...
متن کاملSteadfast Logic Programs
We present the notion of steadfastness that at once embodies modularity, reusability, and formal correctness. A steadfast program is an open program with parameters, which is parametrically correct in the sense that it will always be correct with respect to its (open) speciication whenever its parameters are computed correctly. Thus, a steadfast program is correct , modular and reusable. Theref...
متن کاملModularity of the Quasi-interpretations Synthesis and an Application to Higher-Order Programs
Quasi-interpretations have shown their interest to deal with resource analysis of first order functional programs. There are at least two reasons to study the question of modularity of quasi-interpretations. Firstly, modularity allows to decrease the complexity of the quasi-interpretation search algorithms. Secondly, modularity allows to increase the intentionality of the quasi-interpretation m...
متن کامل